منابع مشابه
Automatic supermartingales acting on sequences
This paper describes a construction of supermartingales realized as automatic functions. A capital of supermartingales is represented using automatic capital groups (ACG). Properties of these automatic supermartingales are then studied. Automatic supermartingales induce a notion of random infinite binary sequence. We show that the class of random sequences coincide with that of disjunctive sequ...
متن کاملOn normal domination of (super)martingales
Let (S0, S1, . . . ) be a supermartingale relative to a nondecreasing sequence of σ-algebras (H60,H61, . . . ), with S0 6 0 almost surely (a.s.) and differences Xi := Si − Si−1. Suppose that for every i = 1, 2, . . . there exist H6(i−1)-measurable r.v.’s Ci−1 and Di−1 and a positive real number si such that Ci−1 6 Xi 6 Di−1 and Di−1−Ci−1 6 2si a.s. Then for all natural n and all functions f sat...
متن کاملFinitely Additive Supermartingales
The concept of finitely additive supermartingales, originally due to Bochner, is revived and developed. We exploit it to study measure decompositions over filtered probability spaces and the properties of the associated Doléans-Dade measure. We obtain versions of the Doob Meyer decomposition and, as an application, we establish a version of the Bichteler and Dellacherie theorem with no exogenou...
متن کاملDomination Normal Form - Decomposing Relational Database Schemas
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas can be determined using integrity constraints defined on the schema, such as functional, multivalued or join dependencies. In this paper we propose and analyze a new normal form based on the idea of minimizing overall st...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2006
ISSN: 1083-6489
DOI: 10.1214/ejp.v11-371